A Class of Continuous Separable Nonlinear Multidimensional Knapsack Problems
نویسندگان
چکیده
منابع مشابه
A library for continuous convex separable quadratic knapsack problems
The Continuous Convex Separable Quadratic Knapsack problem (CQKnP) is an easy but useful model that has very many different applications. Although the problem can be solved quickly, it must typically be solved very many times within approaches to (much) more difficult models; hence an efficient solution approach is required. We present and discuss a small open-source library for its solution th...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملContinuous Knapsack Problems
TIle multiple-choice continuous knapsack problem is dermed as follows: maximize z = ~n ~~i CjJ'XiJ' 1=1 J= 1 subject to (1) ~n ~mi aijXij .;;; b, (2) 0 .;;; Xij .;;; I, i = 1,2, ... , n,j = 1. 2, ... , mi, (3) at most one of Xij G = 1,2, ... , mi) 1=1 J=1 is positive for each i = I, 2, ... , n, where n, mi are positive integers and aij are nonnegative integers. In this paper, it is proved that ...
متن کاملa dynamic programming approach for solving nonlinear knapsack problems
nonlinear knapsack problems (nkp) are the alternative formulation for the multiple-choice knapsack problems. a powerful approach for solving nkp is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملPacking While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems
Packing and vehicle routing problems play an important role in the area of supply chain management. In this paper, we introduce a non-linear knapsack problem that occurs when packing items along a fixed route and taking into account travel time. We investigate constrained and unconstrained versions of the problem and show that both are NP-hard. In order to solve the problems, we provide a pre-p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Operations Research
سال: 2018
ISSN: 2160-8830,2160-8849
DOI: 10.4236/ajor.2018.84015